Three solutions for a mixed boundary value problem involving the one-dimensional p-Laplacian

This paper deals with two mixed nonlinear boundary value problems depending on a parameter λ. For each of them we prove the existence of at least three generalized solutions when λ lies in an exactly determined open interval. Usefulness of this information on the interval is then emphasized by means of some consequences. Our main tool is a very recent three critical points theorem stated in [Topol. Methods Nonlinear Anal. 22 (2003) 93-104].     

Critical exponent for semilinear damped wave equations in the N-dimensional half space

We generalize a previous result of Ikehata (Math. Methods Appl. Sci., in press), which studies the critical exponent problem of a semilinear damped wave equation in the one-dimensional half space, to the general N-dimensional half space case. That is to say, one can show the small data global existence of solutions of a mixed problem for the equation u_tt−Δu+u_t=|u|^p with the power p satisfying p∗(N)=1+2/(N+1)<p?N/[N−2]+ if we deal with the problem in the N-dimensional half space.     

A note on the critical points of equilibrium paths in imperfect structures

In a recent work (Int. J. Solids Struct. 37 (2000) 1561) by one of the authors, an extended system for calculating critical points of equilibrium paths in imperfect structures was presented. However, the extremum nature of these points was not analyzed explicitly in that paper. In this note, we will fill in the gap and establish a sufficient condition for determining the buckling strength of imperfect structures.     

ICF靶丸中液氢层厚度的确定

 利用靶丸内部的质量守恒，提出了计算惯性约束聚变靶丸内液氢层厚度的函数关系式，从而得到了求解惯性约束聚变靶丸内液氢层厚度的一般模型，并在此基础上对影响液氢层厚度的各类因素如温度、充气密度等进行了讨论。该模型的分析方法同样适用于惯性约束聚变中的燃料气体氘、氚或者氘氚混合物。     

关于k—消去图的若干新结果

设G是一个图．k是自然数．图G的一个k-正则支撑子图称为G的一个k-因子．若对于G的每条边e．G—e都存在一个k-因子，则称G是一个k-消去图．该文得到了一个图是k-消去图的若干充分条件，推广了文［2—4］中有关结论．     

两个图的积的S-不可收缩性(英)

本文从组合角度明确给出了两个图的积是S-不可收缩的特征．     

Odd subgraphs and matchings

Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if deg_H(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching.     

Statistical mechanics of warm and cold unfolding in proteins

We present a statistical mechanics treatment of the stability of globular proteins which takes explicitly into account the coupling between the protein and water degrees of freedom. This allows us to describe both the cold and the warm unfolding, thus qualitatively reproducing the known thermodynamics of proteins. Received: 19 March 1998 / Revised and Accepted: 25 May 1998     

Tree-edges deletion problems with bounded diameter obstruction sets

We study the following problem: given a tree G and a finite set of trees H, find a subset O of the edges of G such that G-O does not contain a subtree isomorphic to a tree from H, and O has minimum cardinality. We give sharp boundaries on the tractability of this problem: the problem is polynomial when all the trees in H have diameter at most 5, while it is NP-hard when all the trees in H have diameter at most 6. We also show that the problem is polynomial when every tree in H has at most one vertex with degree more than 2, while it is NP-hard when the trees in H can have two such vertices.The polynomial-time algorithms use a variation of a known technique for solving graph problems. While the standard technique is based on defining an equivalence relation on graphs, we define a quasiorder. This new variation might be useful for giving more efficient algorithm for other graph problems.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.